Dyadic predicates

См. также в других словарях:

• Semiotic elements and classes of signs — C. S. Peirce articles  General:    Charles Sanders Peirce Charles Sanders Peirce bibliography Philosophical:    Categories (Peirce) Semiotic elements and   classes of signs (Peirce) Pragmatic maxim • Pragmaticism… …   Wikipedia

• Categories (Peirce) — On May 14, 1867, the 27 year old Charles Sanders Peirce, who eventually founded Pragmatism, presented a paper entitled On a New List of Categories to the American Academy of Arts and Sciences. Among other things, this paper outlined a theory of… …   Wikipedia

• DPD — Deutscher Paketdienst (International » German) * Detroit Police Department (Community » Law) * Detroit Police Department (Governmental) * Data Print Distribution (Computing » General) * Diffuse pulmonary disease (Medical » Physiology) * Dyadic… …   Abbreviations dictionary

• formal logic — the branch of logic concerned exclusively with the principles of deductive reasoning and with the form rather than the content of propositions. [1855 60] * * * Introduction       the abstract study of propositions, statements, or assertively used …   Universalium

• logic — logicless, adj. /loj ik/, n. 1. the science that investigates the principles governing correct or reliable inference. 2. a particular method of reasoning or argumentation: We were unable to follow his logic. 3. the system or principles of… …   Universalium

• Pragmatic theory of truth — refers to those accounts, definitions, and theories of the concept truth that distinguish the philosophies of pragmatism and pragmaticism. The conception of truth in question varies along lines that reflect the influence of several thinkers,… …   Wikipedia

• Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… …   Wikipedia

• Predicate functor logic — In mathematical logic, predicate functor logic (PFL) is one of several ways to express first order logic (formerly known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic… …   Wikipedia

• Mereology — In philosophy and mathematical logic, mereology (from the Greek μέρος, root: μερε(σ) , part and the suffix logy study, discussion, science ) treats parts and the wholes they form. Whereas set theory is founded on the membership relation between a …   Wikipedia

• Indian philosophy — Any of the numerous philosophical systems developed on the Indian subcontinent, including both orthodox (astika) systems, namely, the Nyaya, Vaisheshika, Samkhya, Yoga, Mimamsa, and Vedanta schools of philosophy, and unorthodox (nastika) systems …   Universalium

• Arity — In logic, mathematics, and computer science, the arity i/ˈær …   Wikipedia